Organic Structures Emerging From Bio-Inspired Graph-Rewriting Automata

Graph-Rewriting Automata (GRA) are an extension of Cellular Automata to a dynamic structure using local graph-rewriting rules. This work introduces linear algebra based tools that allow for a practical investigation of their behavior in deeply extended time scales. A natural subset of GRA is explored in different ways thereby demonstrating the benefits of this method. Some elements of the subset were discovered to create chaotic patterns of growth and others to generate organic-looking graph structures. These phenomena suggest a strong relevance of GRA in the modeling natural complex systems. The approach presented here can be easily adapted to a wide range of GRA beyond the chosen subset

Quantum clustering analysis: Minima of the potential energy function

International audienceQuantum clustering (QC), is a data clustering algorithm based on quantum mechanics which is accomplished by substituting each point in a given dataset with a Gaussian. The width of the Gaussian is a value, a hyper-parameter which can be manually defined and manipulated to suit the application. Numerical methods are used to find all the minima of the quantum potential as they correspond to cluster centers. Herein, we investigate the mathematical task of expressing and finding all the roots of the exponential polynomial corresponding to the minima of a twodimensional quantum potential. This is an outstanding task because normally such expressions are impossible to solve analytically. However, we prove that if the points are all included in a square region of size , there is only one minimum. This bound is not only useful in the number of solutions to look for, by numerical means, it allows to to propose a new numerical approach "per block". This technique decreases the number of particles (or samples) by approximating some groups of particles to weighted particles. These findings are not only useful to the quantum clustering problem but also for the exponential polynomials encountered in quantum chemistry, Solid-state Physics and other applications

Processus de percolation non homogène pour la simulation des grappes de chromosomes bivalents durant la méiose chez la souris "mus domesticus 2n=40"

International audienceWe show that an inhomogeneous Bernoulli site percolation process running upon a fullerene’s dual $C'_{1200}$ can be used for representing bivalents attached to the nuclear envelope in mouse Mus M. Domesticus 2n = 40 meiotic spermatocytes during pachytene. It is shown that the induced clustering generated by overlapping percolation domains correctly reproduces the probability distribution observed in the experiments (data) after fine tuning the parameters

Dynamic proofs of retrievability with low server storage

Proofs of Retrievability (PoRs) are protocols which allow a client to store data remotely and to efficiently ensure, via audits, that the entirety of that data is still intact. A dynamic PoR system also supports efficient retrieval and update of any small portion of the data. We propose new, simple protocols for dynamic PoR that are designed for practical efficiency, trading decreased persistent storage for increased server computation, and show in fact that this tradeoff is inherent via a lower bound proof of time-space for any PoR scheme. Notably, ours is the first dynamic PoR which does not require any special encoding of the data stored on the server, meaning it can be trivially composed with any database service or with existing techniques for encryption or redundancy. Our implementation and deployment on Google Cloud Platform demonstrates our solution is scalable: for example, auditing a 1TB file takes just less than 5 minutes and costs less than $0.08 USD. We also present several further enhancements, reducing the amount of client storage, or the communication bandwidth, or allowing public verifiability, wherein any untrusted third party may conduct an audit

A vertically discretised canopy description for ORCHIDEE (SVN r2290) and the modifications to the energy, water and carbon fluxes

Since 70% of global forests are managed and forests impact the global carbon cycle and the energy exchange with the overlying atmosphere, forest management has the potential to mitigate climate change. Yet, none of the land surface models used in Earth system models, and therefore none of today’s predictions of future climate, account for the interactions between climate and forest management. We addressed this gap in modelling capability by developing and parametrizing a version of the land surface model ORCHIDEE to simulate the biogeochemical and biophysical effects of forest management. The most significant changes between the new branch called ORCHIDEE-CAN (SVN r2290) and the trunk version of ORCHIDEE (SVN r2243) are the allometric-based allocation of carbon to leaf, root, wood, fruit and reserve pools; the transmittance, absorbance and reflectance of radiation within the canopy; and the vertical discretisation of the energy budget calculations. In addition, conceptual changes were introduced towards a better process representation for the interaction of radiation with snow, the hydraulic architecture of plants, the representation of forest management and a numerical solution for the photosynthesis formalism of Farquhar, von Caemmerer and Berry. For consistency reasons, these changes were extensively linked throughout the code. Parametrization was revisited after introducing twelve new parameter sets that represent specific tree species or genera rather than a group of often distantly related or even unrelated species, as is the case in widely used plant functional types. Performance of the new model was compared against the trunk and validated against independent spatially explicit data for basal area, tree height, canopy strucure, GPP, albedo and evapotranspiration over Europe. For all tested variables ORCHIDEE-CAN outperformed the trunk regarding its ability to reproduce large-scale spatial patterns as well as their inter-annual variability over Europe. Depending on the data stream, ORCHIDEE-CAN had a 67% to 92% chance to reproduce the spatial and temporal variability of the validation data.JRC.H.5-Land Resources Managemen

Complex Self-reproducing Systems

International audienc

A Comprehensive Analysis of Quantum Clustering : Finding All the Potential Minima

International audienceQuantum clustering (QC), is a data clustering algorithm based on quantum mechanics which is accomplished by substituting each point in a given dataset with a Gaussian. The width of the Gaussian is a σ value, a hyper-parameter which can be manually defined and manipulated to suit the application. Numerical methods are used to find all the minima of the quantum potential as they correspond to cluster centers. Herein, we investigate the mathematical task of expressing and finding all the roots of the exponential polynomial corresponding to the minima of a two-dimensional quantum potential. This is an outstanding task because normally such expressions are impossible to solve analytically. However, we prove that if the points are all included in a square region of size σ, there is only one minimum. This bound is not only useful in the number of solutions to look for, by numerical means, it allows to to propose a new numerical approach "per block". This technique decreases the number of particles by approximating some groups of particles to weighted particles. These findings are not only useful to the quantum clustering problem but also for the exponential polynomials encountered in quantum chemistry, Solid-state Physics and other applications

A short tutorial for DynSys: A program for dynamical systems based on dynamic graphs

Rapport techniqueInternational audienc

Organic Structures Emerging From Bio-Inspired Graph-Rewriting Automata

International audienceGraph-Rewriting Automata (GRA) are an extension of Cellular Automata to a dynamic structure using local graph-rewriting rules. This work introduces linear algebra based tools that allow for a practical investigation of their behavior in deeply extended time scales. A natural subset of GRA is explored in different ways thereby demonstrating the benefits of this method. Some elements of the subset were discovered to create chaotic patterns of growth and others to generate organic-looking graph structures. These phenomena suggest a strong relevance of GRA in the modeling natural complex systems. The approach presented here can be easily adapted to a wide range of GRA beyond the chosen subset